Range search on tuples of points
نویسندگان
چکیده
منابع مشابه
Range search on tuples of points
a r t i c l e i n f o a b s t r a c t Range search is a fundamental query-retrieval problem, where the goal is to preprocess a given set of points so that the points lying inside a query object (e.g., a rectangle, or a ball, or a halfspace) can be reported efficiently. This paper considers a new version of the range search problem: Several disjoint sets of points are given along with an orderin...
متن کاملCoherent spherical range-search for dynamic points on GPUs
We present an approach to accelerate spherical range-search (SRS) for dynamic points that employs the computational power of many-core GPUs. Unlike finding k approximate nearest neighbours (ANNs), exact SRS is needed in geometry processing and physical simulation to avoid missing small features. The spatial coherence of query points and the temporal coherence of dynamic points are exploited in ...
متن کاملAn Optimal Algorithm for Range Search on Multidimensional Points
This paper proposes an efficient and novel method to address range search on multidimensional points in θ(t) time, where t is the number of points reported in < space. This is accomplished by introducing a new data structure, called BITS kd-tree. This structure also supports fast updation that takes θ(1) time for insertion and O(logn) time for deletion. The earlier best known algorithm for this...
متن کاملMany collinear k-tuples with no k+1 collinear points
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
متن کاملAggregated 2D Range Queries on Clustered Points
Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. We introduce a technique to represent grids supporting aggregated range queries that requires little space when the data points in the grid are clustered, which is common in practice. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2014.10.006